A generalized Ihara zeta function formula for simple graphs with bounded degree
نویسندگان
چکیده
We establish a generalized Ihara zeta function formula for simple graphs with bounded degree. This is generalization of the obtained by G. Chinta, J. Jorgenson and A. Karlsson from vertex-transitive graphs.
منابع مشابه
Edge Reconstruction of the Ihara Zeta Function
We show that if a graph G has average degree d ≥ 4, then the Ihara zeta function of G is edge-reconstructible. We prove some general spectral properties of the Bass–Hashimoto edge adjancency operator T : it is symmetric on a Kreı̆n space and has a “large” semi-simple part (but it can fail to be semi-simple in general). We prove that this implies that if d > 4, one can reconstruct the number of n...
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملA Combinatorial Proof of Bass’s Evaluations of the Ihara-selberg Zeta Function for Graphs
We derive combinatorial proofs of the main two evaluations of the Ihara-Selberg zeta function associated with a graph. We give three proofs of the first evaluation all based on the algebra of Lyndon words. In the third proof it is shown that the first evaluation is an immediate consequence of Amitsur’s identity on the characteristic polynomial of a sum of matrices. The second evaluation of the ...
متن کاملAn Infinite Family of Graphs with the Same Ihara Zeta Function
In 2009, Cooper presented an infinite family of pairs of graphs which were conjectured to have the same Ihara zeta function. We give a proof of this result by using generating functions to establish a one-to-one correspondence between cycles of the same length without backtracking or tails in the graphs Cooper proposed. Our method is flexible enough that we are able to generalize Cooper’s graph...
متن کاملThe Ihara zeta function for graphs and 3-adic convergence of the Sierpiński gasket
Imagine you were going for a run downtown. You have a set distance you want to go, but you don’t like running the same path two days in a row. You don’t like stopping to turn around and take the same road since this breaks your stride, and just repeating some loop multiple times makes you bored. So, how many options do you have? This situation could be modeled with graph theory, where each inte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2023
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2022.113138